On the minimum of a positive polynomial over the standard simplex
نویسندگان
چکیده
We present a new positive lower bound for the minimum value taken by a polynomial P with integer coefficients in k variables over the standard simplex of R, assuming that P is positive on the simplex. This bound depends only on the number of variables k, the degree d and the bitsize τ of the coefficients of P and improves all previous bounds for arbitrary polynomials which are positive over the simplex.
منابع مشابه
An Efficient Extension of Network Simplex Algorithm
In this paper, an efficient extension of network simplex algorithm is presented. In static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. In this paper, the Static Scheduling problem of Automated Guided Vehicles in container terminal is solved by Network Simplex Algorithm (NSA) and NSA+, which extended the stand...
متن کاملA bound on the minimum of a real positive polynomial over the standard simplex
We consider the problem of bounding away from 0 the minimum value m taken by a polynomial P ∈ Z [X1, . . . , Xk] over the standard simplex ∆ ⊂ R, assuming that m > 0. Recent algorithmic developments in real algebraic geometry enable us to obtain a positive lower bound on m in terms of the dimension k, the degree d and the bitsize τ of the coefficients of P . The bound is explicit, and obtained ...
متن کاملOn the complexity of optimization over the standard simplex
We review complexity results for minimizing polynomials over the standard simplex and unit hypercube. In addition, we derive new results on the computational complexity of approximating the minimum of some classes of functions (including Lipschitz continuous functions) on the standard simplex. The main tools used in the analysis are Bernstein approximation and Lagrange interpolation on the simp...
متن کاملScheduling in Container Terminals using Network Simplex Algorithm
In static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. In this paper, the Static Scheduling problem of Automated Guided Vehicles in container terminal is solved by the Network Simplex Algorithm (NSA). The algorithm is based on graph model and their performances are at least 100 times faster than traditional si...
متن کاملA PTAS for the minimization of polynomials of fixed degree over the simplex
Abstract. We consider the problem of computing the minimum value pmin taken by a polynomial p(x) of degree d over the standard simplex ∆. This is an NP-hard problem already for degree d = 2. For any integer k ≥ 1, by minimizing p(x) over the set of rational points in ∆ with denominator k, one obtains a hierarchy of upper bounds p∆(k) converging to pmin as k −→ ∞. These upper approximations are ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Comput.
دوره 45 شماره
صفحات -
تاریخ انتشار 2010